Maximal Arc-Length Matching at Multiple Thresholds (MALT) for Variational Shape Recognition
نویسندگان
چکیده
Widely varying shapes are diÆcult to recognize especially when present as part of an occluded shape. Handling such situations requires the consolidation of data at di erent levels of con dence, which is the philosophy motivating the Maximal Arc-Length matching at multi-Thresholds algorithm (MALT). The algorithm matches segments from two contours and rates a pair of matches more highly if the arc-length shift in the two matches is equal. Unlike traditional matching strategies, dependency on threshold selection is avoided by considering multiple thresholds and ranking the matches. All the models are tested in the polygonal domain, in which variational shape classes at di erent levels of deformation have been generated using vertex and edge deformation from a nominal model. Although in its current form the algorithm is restricted to polygonal contours, in this domain it exhibits very robust recognition even in the presence high deformations and occlusion.
منابع مشابه
Affine invariant non-rigid shape analysis
Shape recognition deals with the study geometric structures. Modern surface processing methods can cope with non-rigidity by measuring the lack of isometry, deal with similarity by multiplying the Euclidean arc-length by the Gaussian curvature, and manage equi-affine transformations by resorting to the special affine arc-length definition in classical affine geometry. Here, we propose a computa...
متن کاملShape Matching by Elastic Deformation
In this paper we present a new one-dimensional shape matching technique based on elastic deformation of a model or template. Deformations of the given template are introduced as a way to improve the matching with the image data. A trade-o is made between the amount of deformation and a gure of merit that accounts for the match. This approach yields a new optimization functional so that the opti...
متن کاملObject Recognition Using Shape-from-Shading
ÐThis paper investigates whether surface topography information extracted from intensity images using a recently reported shape-from-shading (SFS) algorithm can be used for the purposes of 3D object recognition. We consider how curvature and shape-index information delivered by this algorithm can be used to recognize objects based on their surface topography. We explore two contrasting object r...
متن کاملVariational shape matching for shape classification and retrieval
In this paper we define a multi-scale distance between shapes based on geodesics in the shape space. The proposed distance, robust to outliers, uses shape matching to compare shapes locally. The multi-scale analysis is introduced in order to address local and global variabilities. The resulting similarity measure is invariant to translation, rotation and scaling independently of constraints or ...
متن کاملAn Efficient Silent Self-Stabilizing 1-Maximal Matching Algorithm in Anonymous Networks
We propose a new self-stabilizing 1-maximal matching algorithm which is silent and works for any anonymous networks without a cycle of length of a multiple of 3 under a central unfair daemon. The 1-maximal matching is a 2 3 -approximation to the maximum matching, and expected to get more matching pairs than a maximal matching, which only guarantees a 1 2 -approximation. The time complexity of t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000